By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 9, Issue 4, pp. 665-855

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes

Krzysztof R. Apt and Lambert G. L. T. Meertens

pp. 665-671

BibTeX  Abstract Full Text:  PDF

A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm

Leo J. Guibas and Andrew M. Odlyzko

pp. 672-682

BibTeX  Abstract Full Text:  PDF

Compatible Orderings on the Metric Theory of Trees

Stephen L. Bloom and Ralph Tindell

pp. 683-691

BibTeX  Abstract Full Text:  PDF

Approximate Solutions for the Bilinear Form Computational Problem

Dario Bini, Grazia Lotti, and Francesco Romani

pp. 692-697

BibTeX  Abstract Full Text:  PDF

The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability

David A. Plaisted

pp. 698-705

BibTeX  Abstract Full Text:  PDF

Constant Time Generation of Rooted Trees

Terry Beyer and Sandra Mitchell Hedetniemi

pp. 706-712

BibTeX  Abstract Full Text:  PDF

On the Complexity of Bilinear Forms with Commutativity

Joseph JáJá

pp. 713-728

BibTeX  Abstract Full Text:  PDF

Equality Sets and Complexity Classes

Ronald V. Book and Franz–Josef Brandenburg

pp. 729-743

BibTeX  Abstract Full Text:  PDF

Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer

David Nassimi and Sartaj Sahni

pp. 744-757

BibTeX  Abstract Full Text:  PDF

Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields

Gadiel Seroussi and Abraham Lempel

pp. 758-767

BibTeX  Abstract Full Text:  PDF

A Model and Proof Technique for Message-Based Systems

Jerome A. Feldman and Anil Nigam

pp. 768-784

BibTeX  Abstract Full Text:  PDF

Efficient On-Line Construction and Correction of Position Trees

Mila E. Majster and Angelika Reiser

pp. 785-807

BibTeX  Abstract Full Text:  PDF

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and R. E. Tarjan

pp. 808-826

BibTeX  Abstract Full Text:  PDF

A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality

Bengt Aspvall and Yossi Shiloach

pp. 827-845

BibTeX  Abstract Full Text:  PDF

Orthogonal Packings in Two Dimensions

Brenda S. Baker, E. G. Coffman, Jr., and Ronald L. Rivest

pp. 846-855

BibTeX  Abstract Full Text:  PDF